Multicommodity network flow with jump constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multicommodity Network Flow with Inverse Linear Constraints

In many application areas engineering, communications, logistics, manufacturing, transportation, different non-homogeneous commodities are distributed over the same underlying network. Usually the separate commodities share common arc capacities that restrict the integrated flow of the gross commodities on the arc. Furthermore, there exists a mutual interaction between the commodities. The ge...

متن کامل

Single-Sink Multicommodity Flow with Side Constraints

In recent years, several new models for network flows have been analyzed, inspired by emerging telecommunication technologies. These include models of resilient flow, motivated by the introduction of high capacity optical links, coloured flow, motivated by Wavelength-Division-Multiplexed optical networks, unsplittable flow motivated by SONET networks, and confluent flow motivated by next-hop ro...

متن کامل

Multicommodity Network Flow Problems

In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...

متن کامل

Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints

The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network ow problem is simply its linear approximation. Instead of solving the subproblem optimally, this paper demonstrates that performing one iteration of Dantzig– Wolfe decomposition is generally su cient for SD to e ciently converge to an optimal solution. c © 2000 Elsevier Science B.V. All rights reserved.

متن کامل

Reliability Evaluation of Multicommodity Limited-Flow Networks with Budget Constraints

Many real-world systems such as manufacturing systems, transportation systems and logistics/distribution systems that play important roles in our modern society can be regarded as multicommodity flow networks whose arcs have independent, finite and multi-valued random capacities. Such a flow network is a multistate system with multistate components and its reliability for level (d;c), i.e., the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1997

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(96)00194-x